Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian
نویسنده
چکیده
A graph is hamiltonian if it has a hamiltonian cycle. It is well-known that Tutte proved that any 4connected planar graph is hamiltonian. It is also well-known that the problem of determining whether a 3-connected planar graph is hamiltonian is NP-complete. In particular, Chvátal and Wigderson had independently shown that the problem of determining whether a maximal planar graph is hamiltonian is NP-complete. A classical theorem of Whitney says that any maximal planar graph with no separating triangles is hamiltonian, where a separating triangle is a triangle whose removal separates the graph. Note that if a planar graph has separating triangles, then it can not be 4-connected and therefore Tutte’s result can not be applied. In this paper, we shall prove that any maximal planar graph with only one separating triangle is still hamiltonian.
منابع مشابه
Hamilton cycles in plane triangulations
We extend Whitney’s Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely we define a decomposition of a plane triangulation G into 4-connected ‘pieces’ and show that if each piece shares a triangle with at most three other pieces then G is hamiltonian. We provide an example to show that our hypothesis that ‘each...
متن کاملOn Hamiltonian Cycles through Prescribed Edges of a Planar Graph
We use [3] for terminology and notation not defined here and consider finite simple graphs only. The first major result on the existence of hamiltonian cycles in graphs embeddable in surfaces was by H. Whitney [12] in 1931, who proved that 4-connected maximal planar graphs are hamiltonian. In 1956, W.T. Tutte [10,11] generalized Whitney’s result from maximal planar graphs to arbitrary 4-connect...
متن کاملPlanarity of Intersection Graph of submodules of a Module
Let $R$ be a commutative ring with identity and $M$ be an unitary $R$-module. The intersection graph of an $R$-module $M$, denoted by $Gamma(M)$, is a simple graph whose vertices are all non-trivial submodules of $M$ and two distinct vertices $N_1$ and $N_2$ are adjacent if and only if $N_1cap N_2neq 0$. In this article, we investigate the concept of a planar intersection graph and maximal subm...
متن کاملHamiltonian Cycles in Triangle Graphs
We prove that the Hamiltonian cycle problem is NP complete for a class of planar graphs named triangle graphs that are closely related to inner triangulated graphs We present a linear time heuristic algorithm that nds a solution at most one third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics
متن کاملHamiltonian Cycle Problem for Triangle Graphs
We show that the Hamiltonian cycle problem is NP-complete for a class of planar graphs named triangle graphs that are closely related to inner-triangulated graphs. We present a linear-time heuristic algorithm that nds a solution at most one-third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 7 شماره
صفحات -
تاریخ انتشار 2003